Graphbots: cooperative motion planning in discrete spaces
نویسندگان
چکیده
منابع مشابه
Graphbots: cooperative motion planning in discrete spaces
Most previous theoretical work on motion planning for a group of robots has addressed the problem of path planning for the individual robots sequentially, in geometrically simple regions of Euclidean space (e.g., a planar region containing polygonal obstacles). In this paper, we define a version of the motionplanning problem in which the robots move simultaneously. We establish conditions under...
متن کاملConstrained Motion Planning in Discrete State Spaces
We propose a principled method to create a search space for constrained motion planning, which efficiently encodes only feasible motion plans. The space of possible paths is encoded implicitly in the connections between states, but only feasible and only local connections are allowed. Furthermore, we propose a systematic method to generate a near-minimal set of spatially distinct motion alterna...
متن کاملMotion Planning in Non-Gaussian Belief Spaces
In environments with information symmetry, uncertain or ambiguous data associations can lead to a multi-modal hypothesis on the robot’s state. Thus, a planner cannot simply base actions on the most-likely state. We propose an algorithm that uses a Receding Horizon Planning approach to plan actions that sequentially disambiguate a multi-modal belief to a uni-modal Gaussian and achieve tight loca...
متن کاملTopological robotics: motion planning in projective spaces
In this paper we study one of the most elementary problems of the topological robotics: rotation of a line, which is fixed by a revolving joint at a base point: one wants to bring the line from its initial position A to a final position B by a continuous motion in the space. The final goal is to construct a motion planning algorithm which will perform this task once the initial position A and t...
متن کاملPlanning Cooperative Motion for Distributed Mobile Agents
The problem of planning the motion is investigated for distributed multiple mobile agents A method is proposed for a few heterogeneous mobile agents (robots) of diierent sizes and moving capabitilies to coordinate their motions in a distributed manner to achieve a map-making task. The agents are assumed to have suucient memory to store the map and to be able to communicate with each other. Our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
سال: 1998
ISSN: 1094-6977
DOI: 10.1109/5326.661088